Node configuration and self-healing for ad hoc networks

ABSTRACT

A network includes at least one node to communicate with at least one other node via a wireless network protocol. The node includes a network configuration module to periodically switch a current node function of the node between an intermediate node function and a leaf node function. The switch of the current node function enables automatic reconfiguration of the wireless network based on detected communications between the at least one node and at least one intermediate node or at least one leaf node via the wireless network protocol.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims the benefit of U.S. Provisional PatentApplication 62/346,879 filed on 7 Jun. 2016, and entitled “Systems andMethods to Improve Self-Healing and Self-Organization in WirelessNetworks”, the entirety of which is incorporated by reference herein.

TECHNICAL FIELD

This disclosure relates to networks, and more particularly to networknodes that can automatically change node configuration to facilitateself-healing of an ad hoc wireless network.

BACKGROUND

Network time slotted protocols are widely used to establishcommunications between network nodes utilizing a predictable time frameslotting technique for nodes to communicate, where each network nodecommunicates according to predefined slots. Such protocols providescheduled, contention-free channel access to improve throughputperformance compared to carrier sense techniques. These protocols areoften employed in the formation of ad hoc wireless communicationsnetworks, for example. Ad hoc wireless communications networks areformed dynamically as nodes come within range of existing networkresources. These networks may be utilized in many applications toprovide communications between lower level devices on the networks suchas sensors and upper tier devices communicating with the sensors.

In some applications, routing protocols are created that definerelationships in the network and how the network operates as conditionschange. For example, each node within the network can have a preferredparent node that it can communicate in an upwards direction and possiblyhaving multiple child nodes for downward communications. The parentnodes are sometimes referred to as a root node or intermediate node andthe child nodes are sometimes referred to as leaf nodes.

SUMMARY

This disclosure relates to network nodes that can automatically changenode configuration to facilitate self-healing of an ad hoc wirelessnetwork. In one example, a network includes at least one node tocommunicate with at least one other node via a wireless networkprotocol. The node includes a network configuration module toperiodically switch a current node function of the node between anintermediate node function and a leaf node function. The switch of thecurrent node function enables automatic reconfiguration of the wirelessnetwork based on detected communications between the at least one nodeand at least one intermediate node or at least one leaf node via thewireless network protocol.

In another example, a method includes configuring at least one node of awireless network as an intermediate node. The method includes detectingif at least one leaf node is connected to the intermediate node via thewireless network. The method includes switching the intermediate node toa leaf node if no communications are detected with the at least one leafnode after a predetermined time period.

In yet another example, a method includes configuring at least one nodeof a wireless network as an intermediate node. The method includesdetecting if at least one leaf node is connected to the intermediatenode via the wireless network. The method includes periodicallyswitching the intermediate node to a leaf node if no communications aredetected with the at least one leaf node after a predetermined timeperiod. The method includes periodically switching the leaf node back tothe intermediate node to detect if subsequent leaf nodes are present inthe wireless network.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an example network where a node can automaticallyreconfigure its node function to facilitate self-healing of the network.

FIG. 2 illustrates an example of a network protocol for a self-healingnetwork that utilizes channels, slot frames and time slots.

FIG. 3 illustrates an example network configuration having multipleintermediate and leaf nodes that can periodically change nodefunctionality.

FIG. 4 illustrates an example method that employs a staticreconfiguration of a network to facilitate self-healing of the network.

FIG. 5 illustrates an example method that employs a dynamicreconfiguration of a network to facilitate self-healing of the network.

FIG. 6 illustrates an example node that can automatically reconfigureits node function to facilitate self-healing of a network.

DETAILED DESCRIPTION

This disclosure relates to network nodes that can automatically changenode configuration to facilitate self-healing and automaticconfiguration of an ad hoc wireless network. A network configurationmodule is provided that enables intermediate or leaf nodes in thenetwork to periodically change their function (e.g., from leaf node tointermediate node or vise versa) depending on detected conditions of thenetwork. For example, nodes can initially be configured as anintermediate node that can communicate with one or more other leaf nodeson the network. If no leaf nodes are detected or communications with aknown leaf node is not detected by the network configuration modulewithin a given time period, the intermediate node can automaticallyreconfigure itself as a leaf node to reduce its operating complexity andto conserve power in the network. Conversely, if a leaf node detectsthat its corresponding intermediate node is no longer active, the leafnode can automatically change its function to an intermediate node anddetermine if there are other leaf nodes on the network that cancommunicate to the intermediate node. In this manner, self-healing ofthe network is provided since if an intermediate node becomesnonoperational, other nodes can automatically reconfigure as theintermediate node as network conditions dictate.

Dynamic or static node configuration can be provided where static nodeconfiguration allows a one-time switch from intermediate nodefunctionality to leaf node functionality. Dynamic node configurationallows a node that has switched to a leaf node to periodically switchback to an intermediate node to determine if there are parentless leafnodes that seek an intermediate node to communicate with. Also, byproviding switchable intermediate node and leaf node capability witheach respective node on the network, software complexity can be reducedsince a single software build can be maintained for both intermediatenodes and leaf nodes.

FIG. 1 illustrates an example network where a node can automaticallyreconfigure its node function to facilitate self-healing of the network.In this example, the network 100 includes at least two nodes—a parentnode 110 and a node 120 that employ a wireless protocol to communicateacross a wireless network connection 130. In other examples, more thanone node 120 may be employed (see e.g., FIG. 3). Also, otherintermediate nodes may exist between the parent node 110 and the node120, where the intermediate nodes become the parent nodes for thelower-level leaf nodes. In this example, the parent node 110 can be aroot node or an intermediate node whereas the node 120 can be anintermediate node or a leaf node. The parent node 110 can transmit abroadcast message from the parent node to the node 120 at predeterminedtime intervals according to the wireless network protocol. A schedulingpacket can be communicated in the broadcast message.

The scheduling packet includes a data field to instruct each node 120 toreceive data communicated from the parent node 110 via in a prescribedtime slot following the broadcast message and defined by the schedulingpacket. The scheduling packet can be embedded or encoded within thebroadcast message or can be concatenated along with the broadcastmessage however the scheduling packet is transmitted within the timeslot allocated for the broadcast message. The wireless network protocolcan be any time division multiple access protocol (TDMA), such as a timeslotted channel hopping (TSCH) protocol specified according to IEEE801.15.4e, for example. Thus, the broadcast message can be implementeddepending on the wireless network protocol that is implemented in thenetwork 100. By way of example, the broadcast message can be a beaconthat is periodically transmitted by the parent node 110 as asynchronization phase for a subsequent data transmission phase, forexample.

In this example, the network 100 includes at least one node 120 tocommunicate with at least one other node 120 via a wireless networkprotocol. The node 120 includes a network configuration module 140 toperiodically switch a current node function 144 of the node 120 from anintermediate node function to a leaf node function or from the leaf nodefunction to the intermediate node function. As used herein, the termfunction refers computer-executable instructions operated by the node120 (e.g., processor or controller inside the node) which define thenode as either an intermediate node or a leaf node. The switch ofcurrent node function enables automatic reconfiguration of the wirelessnetwork based on detected communications between the node 120 and atleast one intermediate node, or between the node 120 and at least oneleaf node via the wireless network protocol. The automatic configurationdepends on the current node function 144 and various switchingconditions that are described herein.

As noted previously, the node 120 can communicate with at least oneother node via a time slotted channel hopping protocol as the wirelessnetwork protocol however other wireless protocols are possible. In oneexample, the network configuration module 140 can include a staticconfiguration module 150 that initially configures the node 120 as anintermediate node and periodically switches the node to a leaf node ifno leaf node communications are detected with the intermediate node. Forexample, the static configuration module 150 can start a timer for apredetermined period and switch the intermediate node to the leaf nodevia the node function 144 at the end of the predetermined period if noleaf node communications are detected with the intermediate node.

In another example, the network configuration module 140 can include adynamic configuration module 160 that initially configures the node 120as an intermediate node and periodically switches the node to a leafnode if no leaf node communications are detected with the intermediatenode. The dynamic configuration module 160 then periodically switchesthe leaf node back to the intermediate node to determine if subsequentleaf nodes are present on the network. The network configuration module140 can include a user setting (e.g., switch or software setting) toenable or disable the static configuration module 150 or the dynamicconfiguration module 160 to facilitate static or dynamic mode selectionof the network configuration module 140.

The dynamic configuration module 160 can utilize a dynamic parameterthat defines a time percentage (e.g., 10%) of a given time period (e.g.,1 hour) that the node 120 functions as the intermediate node. Thedynamic configuration module 160 holds the node 120 as the intermediatenode for the time percentage and switches the node from the intermediatenode to the leaf node if there are no leaf nodes connected to theintermediate node. After each given time period, the dynamicconfiguration module can switch the node 120 to the intermediate nodefor the time percentage to detect if other leaf nodes are present. Inanother example, the dynamic configuration module 160 adjusts thedynamic parameter by a given time amount over a number of intervals ofthe given time period if no leaf nodes are detected (e.g., adjust thetime percentage from a high of 90% and reduce time percentage by halfeach time interval). The dynamic configuration module 160 can continueto adjust the dynamic parameter over the number of intervals until aminimum threshold time percentage is achieved (e.g., no lower than 5%).

In yet another example, the dynamic configuration module can include akeep alive timer to monitor the node 120 as the intermediate node. Ifthere is no communications detected by the intermediate node with theleaf node within a time period defined by the keep alive timer, thedynamic configuration module 160 can switch the at least one node 120from the intermediate node to the leaf node. To facilitate that a leafnode will see a beacon that is transmitted over the wireless network130, the dynamic configuration module 160 can define a time intervalwhen the node 120 is configured as the leaf node, where the timeinterval is set to about the time of a beacon interval associated withthe wireless network protocol.

FIG. 2 illustrates an example of a network protocol diagram 200 for aself-healing network that utilizes channels, slot frames and time slots.As used herein, the term time slot refers to a designated period of timein a communications frame where a given node can receive or transmitdata, where a frame is a basic unit of data transport that includes aset of contiguous time-slots transmitted according to a fixed schedulethat repeats over time. Some time slots in the frame are reserved forbeacon communications and some time slots are shared meaning that anynode can transmit data during a shared time slot. Shared time slots arealso referred to as contention slots since multiple nodes can conflictwith each other if each node transmits data during the shared slot.Other time slots are specifically reserved as receive time slots andtransmit time slots for each respective node.

The diagram 200 describes the mode of operation for a time slottedchannel hopping (TSCH) media access control (MAC) although otherprotocols are possible. Time consists of a slot frame 210, where eachslot frame consists of timeslots (or slots) 220. The communicationbetween the nodes in the network occur during the timeslots 220,although, it can happen at different channels shown at 230. For example,if node A and node B are assigned slot 3 in slot frame 1, the channelthat they are communicating in this slot frame is channel 3. However, inslot frame 2, the timeslot number is the same; however, the channelnumber is 5 this time. Note that beacons are transmitted not only by theroot node, but also by the intermediate nodes (see e.g., FIG. 3 forillustration of these nodes). In current networks, there is a cleardistinction in functionality between intermediate and leaf nodes. In thenetworks and methods described herein, a respective node can be anintermediate node or a leaf node depending on detected conditions of thenetwork. This facilitates providing a single software build to supportboth network nodes and their respective functionality which simplifiessoftware design and reduces costs since separate software builds for therespective nodes no longer have to be supported.

FIG. 3 illustrates an example network configuration 300 having multipleintermediate and leaf nodes that can periodically change nodefunctionality. A top level in the network 300 can include a root node304 which serves as a parent node to one or more intermediate nodesshown as INT NODE 1 though INT NODE N, where N is a positive integer.Thus, each of the intermediate nodes can be viewed as a child node ofthe parent nodes. In turn, each of the intermediate nodes 1 though N canhave one or more leaf nodes attached thereto. For example, at 310, leafnodes 11 through 1X can report to intermediate node 1 operating as aparent node, where X is a positive integer. At 320, leaf nodes 21through 2Y can report to intermediate node 2 operating as a parent node,where Y is a positive integer. At 330, child nodes N1 through NZ canreport to intermediate node N operating as a parent node, where N and Zare positive integers.

A dashed line is shown between nodes at the intermediate level andanother dashed line is shown between nodes at the child level, where thedashed line represents that some nodes may be able to communicatebetween other members at a common hierarchy level and some nodes may notbe able to communicate at the common level. In some network examples,intermediate nodes and/or leaf nodes may communicate with other nodes attheir respective hierarchy levels depending on network topologies andnetwork device locations. In other examples, communications can berouted to/from the respective leaf nodes, through the intermediatenodes, to the root node 304 in order to route messages from one node inthe network to another node in the network that is not in the samelinear path as a the respective root node, intermediate node, and childnode.

The network 300 can be provided as a multi-hop wireless network thatconsists of the root node 304, intermediate nodes, and leaf nodes. Theroot node 304 connects the network to an internal or external network.The intermediate nodes connects the leaf nodes (and other intermediatenodes) to the root node and from there to the internal/external network.The definition of leaf nodes here is that there are no other nodesconnected to these nodes. Conventional software builds for theintermediate and leaf nodes are done separately. For example: in beaconchannel hopping networks, a coordinator transmits periodic beacons thatcontain information to facilitate nodes joining and communicating in thenetwork. The information contained in the beacon could be the channelsto be used at a specific time, timing information when this beacon issent, link information, and so forth.

To transmit data in these networks, the nodes can then use the linkinformation, which can be a pair of (channel, time) to communicate andsend data to their neighbors. Intermediate nodes also transmit beaconsand in these beacons, the same information that was sent by thecoordinator is repeated. This is to allow other intermediate and leafnodes to connect to the network. However, conventional leaf nodes do nottransmit beacons as they have a simple software build in order to savememory and provide power efficiency. The networks and methods describedherein provide a single software image for both intermediate and leafnodes. This reduces complexity of software maintenance, while alsoproviding the network the flexibility to be self-healing (e.g., when anintermediate node goes down, another leaf node in the vicinity can takeover and perform the same tasks as the previous intermediate node).

In view of the foregoing structural and functional features describedabove, example methods will be better appreciated with reference toFIGS. 4 and 5. While, for purposes of simplicity of explanation, themethods are shown and described as executing serially, it is to beunderstood and appreciated that the methods are not limited by theillustrated order, as parts of the methods could occur in differentorders and/or concurrently from that shown and described herein. Suchmethods can be executed by various components configured in an IC or aprocessor, for example.

FIG. 4 illustrates an example method 400 that employs a staticreconfiguration of a network to facilitate self-healing of the network.At 410, a method 400 includes configuring at least one node of awireless network as an intermediate node (e.g., via networkconfiguration module 140 of FIG. 1). At 420, the method 400 includesdetecting if at least one leaf node is connected to the intermediatenode via the wireless network (e.g., via network configuration module140 of FIG. 1). This can include determining if a predetermined time haselapsed and if at least one leaf node is present. If these conditionsare not met at 420, the method proceeds back to 420. If the conditionsof 420 are met, the method 400 includes switching the intermediate nodeto a leaf node if no communications are detected with the leaf nodeafter a predetermined time period (e.g., via static configuration module150 of FIG. 1). The node can communicate via a time slotted channelhopping protocol across the wireless network (or other wirelessprotocol). In this example, each node, except the root, starts as anintermediate node. An intermediate node then becomes a leaf node forexample, 1 hour after the node joins the network and provided it doesnot receive any data forwarding request from any other nodes. Thisnetwork is thus self-healing and self-configurable.

FIG. 5 illustrates an example method 500 that employs a dynamicreconfiguration of a network to facilitate self-healing of the network(e.g., via network configuration module 140 of FIG. 1). At 510, themethod 500 includes configuring at least one node of a wireless networkas an intermediate node. At 520, the method 500 includes detecting if atleast one leaf node is connected to the intermediate node via thewireless network (e.g., via network configuration module 140 of FIG. 1).This can include determining if a predetermined time has elapsed and ifat least one leaf node is not present. If these conditions are not metat 520, the method proceeds back to 520. If the conditions of 520 aremet, the method 500 includes switching the intermediate node to a leafnode at 530 if no communications are detected with the leaf node after apredetermined time period (e.g., via dynamic configuration module 160 ofFIG. 1). At 540, the method 500 includes detecting if a predeterminedtime period has elapsed (e.g., via dynamic configuration module 160 ofFIG. 1). If the time period has not elapsed at 540, the method proceedsback to 540. If the time period has elapsed at 540, the method 500includes periodically switching the leaf node back to the intermediatenode at 550 to detect if subsequent leaf nodes are present in thewireless network (e.g., via dynamic configuration module 160 of FIG. 1).As noted previously, the nodes can communicate via a time slottedchannel hopping protocol across the wireless network, for example.

Although not shown, the method 500 can include utilizing a dynamicparameter that defines a time percentage of a given time period that thenode functions as the intermediate node. This can include holding thenode as the intermediate node for the time percentage, switching thenode from the intermediate node to the leaf node if there are no leafnodes connected to the intermediate node, and after each given timeperiod, switching the node to the intermediate node for the timepercentage to detect if other leaf nodes are present. The method 500 caninclude adjusting the dynamic parameter by a given time amount over anumber of intervals of the given time period if no leaf nodes aredetected. This can include adjusting the dynamic parameter over thenumber of intervals until a minimum threshold time percentage isachieved. The method 500 can also include monitoring the node as theintermediate node and if there is no communications detected by theintermediate node with the leaf node within a time period defined by akeep alive timer, then switching the node from the intermediate node tothe leaf node. The method can also include defining a time interval whenthe node is configured as the leaf node, where the time interval is setto about the time of a beacon interval associated with the wirelessnetwork.

In the dynamic switching example of the method 500, the intermediatenode can switch back and forth between being an intermediate and leafnode. Switching rules can be described as: Always starts as anintermediate node; Switch to leaf node if there are no leaf nodesconnected; Switch back to intermediate node based on the rules; Stay fora period of time, then go back to leaf node if there are no leaf nodesconnected and Repeat the dynamic method. Given the time gap, or the timethat the node operates in leaf mode, this can impact the scanning of theleaf nodes trying to connect to this node since their respectiveintermediate node went offline. On/off intervals can be employed forswitching with an on interval being beacon interval and off intervalsbeing min (node_intermediate, node_leaf).

By way of example, assume that every hour (or every 2 minutes), the nodeswitches between intermediate and leaf depending on a dynamic factorparameter. Thus, if the dynamic factor is 0.2, it controls that 20% ofthe time in 1 hour (or other time interval), the node operates as anintermediate node. This includes the following dynamic behavior: Dynamicnode starts as an intermediate node. Assuming a dynamic factor of 10%,it stays as intermediate node for 360 seconds, then switches to leafnode if there are no leaf nodes connected to it. After 1 hour (or otherinterval) elapses, it switches to intermediate node for another 360 secand so on. In an alternative, the dynamic node starts with 90% dynamicfactor. If no leaf node connects, it reduces by half. If no nodeconnects again, it reduces by half and so on, till it reaches itsminimum threshold (e.g., dynamic factor configured to, 10%).

When a dynamic node switches to intermediate node and a leaf nodeconnects to it and stays connected, the dynamic node shall stay inintermediate mode. If leaf node does not have a communication with theintermediate node for a time that exceeds (e.g., 5*KeepAlive timer), thedynamic node shall delete the link and can switch to leaf mode whensuitable. Leaf node scanning can be performed such its detectioninterval is the same (or similar) as beacon interval. The off timeinterval is the same as dynamic_factor*dynamic_interval-beacon_interval,for example.

FIG. 6 illustrates an example node 600 that can automaticallyreconfigure its node function to facilitate self-healing of a network.The example node 600 can be employed as part of a wireless sensornetwork (WSN) or system that contains a plurality (even hundreds ofthousands) of sensor nodes. Such network/system examples where the node600 can be implemented are shown with respect to FIGS. 1 and 3. Eachnode 600 can be equipped with a sensor module 610 to detect physicalphenomena such as light, heat, pressure, and so forth. The sensor nodesin the WSN can communicate among themselves via radio signals utilizingsubstantially any wireless protocol such as Bluetooth, Bluetooth Lowenergy (BLE), WIFI, IEEE 802.11, and Worldwide Interoperability forMicrowave Access (WiMAX) protcol, for example. The individual nodes inthe WSN are inherently resource constrained, thus they tend to belimited in processing speed, storage capacity, and communicationbandwidth. After the sensor nodes are deployed, they are responsible forself-organizing an appropriate network infrastructure often withmulti-hop communication with them. The working mode of the sensor nodesmay be either continuous or event driven for example.

Wireless sensor networks are spatially distributed autonomous sensors tomonitor physical or environmental conditions, such as temperature,sound, pressure, and so forth and to cooperatively pass their datathrough the network to a main location. The more modern networks arebi-directional, also enabling control of sensor activity. The WSN isbuilt of “nodes,” where each node 600 is connected to one (or sometimesseveral) sensors. The WSN's can include ad-hoc networks where nodes canconnect and leave the network dynamically. The node 600 generallyincludes a microcontroller 620, memory 630 (e.g., ferroelectric randomaccess memory (FRAM)), wireless transceiver 640 (e.g., Texas InstrumentCC2500 2.4 GHz RF transceiver), power module 650 (e.g., Texas InstrumentBQ25504), along with the sensor module 610 (e.g., temperature detector,infrared detector, input/output module, analog conversion module).Intermediate nodes and child nodes generally share the same hardware andsoftware but change their status (intermediate/child) depending if theyare configured per a given communications layer operating with the nodememory 630 and/or transceiver 640 such as a routing layer or a networklayer, for example. A root node may have one additional level ofcapability over the intermediate/child nodes which is the ability toconnect to other larger/broader networks such as the Internet.

Size and cost constraints on sensor nodes result in correspondingconstraints on resources such as energy, memory, computational speed,and communications bandwidth. The topology of the WSNs can vary from asimple star network to an advanced multi-hop wireless mesh network. Thepropagation technique between the hops of the network can be routing orflooding. Software is typically reduced in complexity to conserve poweron respective sensor nodes. Examples of node operating software systemscan include TI-RTOS, TinyOS, LiteOS, and Contiki, for example. Othersensor nodes may operate as embedded systems without the use of a givenoperating system. The self-healing and node configuration capabilitiesdescribed herein can be executed by the microcontroller 620 asexecutable instructions operating within the memory 630. In analternative example, the microcontroller 620, memory, transceiver 640,and/or sensor module 610, can be implemented as an application specificintegrated circuit.

What have been described above are examples. It is, of course, notpossible to describe every conceivable combination of components ormethodologies, but one of ordinary skill in the art will recognize thatmany further combinations and permutations are possible. Accordingly,the disclosure is intended to embrace all such alterations,modifications, and variations that fall within the scope of thisapplication, including the appended claims. As used herein, the term“includes” means includes but not limited to, the term “including” meansincluding but not limited to. The term “based on” means based at leastin part on. Additionally, where the disclosure or claims recite “a,”“an,” “a first,” or “another” element, or the equivalent thereof, itshould be interpreted to include one or more than one such element,neither requiring nor excluding two or more such elements.

What is claimed is:
 1. A method, comprising: configuring at least onenode of a wireless network as an intermediate node; detecting if atleast one leaf node is connected to the intermediate node via thewireless network; periodically switching the intermediate node, whichtransmits beacons, to a leaf node which does not transmit beacons and isunable to detect leaf nodes seeking an intermediate node to communicatewith, if no communications are detected with the at least one leaf nodeafter a predetermined time period; and periodically switching the leafnode back to the intermediate node to detect if leaf nodes seeking anintermediate node to communicate with are present in the wirelessnetwork.
 2. The method of claim 1, wherein the at least one nodecommunicates via a time slotted channel hopping protocol across thewireless network.
 3. The method of claim 1, defining a time intervalwhen the at least one node is configured as the leaf node, where thetime interval is set to the time of a beacon interval associated withthe wireless network.
 4. A method, comprising: configuring at least onenode of a wireless network as an intermediate node; detecting if atleast one leaf node is connected to the intermediate node via thewireless network; periodically switching the intermediate node, whichtransmits beacons, to a leaf node, which does not transmit beacons, ifno communications are detected with the at least one leaf node after apredetermined time period; periodically switching the leaf node back tothe intermediate node to detect if subsequent leaf nodes are present inthe wireless network; and utilizing a dynamic parameter that defines atime percentage of a given time period that the at least one nodefunctions as the intermediate node.
 5. The method of claim 4, furthercomprising: holding the at least one node as the intermediate node forthe time percentage; switching the at least one node from theintermediate node to the leaf node if there are no leaf nodes connectedto the intermediate node, and after each given time period; switchingthe at least one node to the intermediate node for the time percentageto detect if other subsequently detected parentless leaf nodes arepresent.
 6. The method of claim 4, further comprising adjusting thedynamic parameter by a given time amount over a number of intervals ofthe given time period if no leaf nodes are detected.
 7. The method ofclaim 6, further comprising adjusting the dynamic parameter over thenumber of intervals until a minimum threshold time percentage isachieved.
 8. The method of claim 6, further comprising monitoring the atleast one node as the intermediate node and if there is nocommunications detected by the intermediate node with the leaf nodewithin a time period defined by a keep alive timer, switching the atleast one node from the intermediate node to the leaf node.
 9. A method,comprising: configuring at least one node of a wireless network as anintermediate node; detecting if at least one leaf node is connected tothe intermediate node via the wireless network; switching theintermediate node, which transmits beacons, to a leaf node which doesnot transmit beacons and is unable to detect leaf nodes seeking anintermediate node to communicate with, if no communications are detectedwith the at least one leaf node after a predetermined time period; andperiodically switching the leaf node back to the intermediate node todetect if leaf nodes seeking an intermediate node to communicate withare present in the wireless network.
 10. The method of claim 9, whereinthe at least one node communicates via a time slotted channel hoppingprotocol across the wireless network.
 11. The method of claim 9,defining a time interval when the at least one node is configured as theleaf node, where the time interval is set to the time of a beaconinterval associated with the wireless network.
 12. A method, comprising:configuring at least one node of a wireless network as an intermediatenode; detecting if at least one leaf node is connected to theintermediate node via the wireless network; switching the intermediatenode, which transmits beacons, to a leaf node, which does not transmitbeacons, if no communications are detected with the at least one leafnode after a predetermined time period; periodically switching the leafnode back to the intermediate node to detect if subsequent leaf nodesare present in the wireless network; and utilizing a dynamic parameterthat defines a time percentage of a given time period that the at leastone node functions as the intermediate node.
 13. The method of claim 12,further comprising: holding the at least one node as the intermediatenode for the time percentage; switching the at least one node from theintermediate node to the leaf node if there are no leaf nodes connectedto the intermediate node, and after each given time period; switchingthe at least one node to the intermediate node for the time percentageto detect if other subsequently detected parentless leaf nodes arepresent.
 14. The method of claim 12, further comprising adjusting thedynamic parameter by a given time amount over a number of intervals ofthe given time period if no leaf nodes are detected.
 15. The method ofclaim 14, further comprising adjusting the dynamic parameter over thenumber of intervals until a minimum threshold time percentage isachieved.
 16. The method of claim 14, further comprising monitoring theat least one node as the intermediate node and if there is nocommunications detected by the intermediate node with the leaf nodewithin a time period defined by a keep alive timer, switching the atleast one node from the intermediate node to the leaf node.